Structured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Palindromic Structures

نویسندگان

  • Shreemayee Bora
  • Michael Karow
  • Christian Mehl
  • Punit Sharma
چکیده

We derive formulas for the backward error of an approximate eigenvalue of a ∗palindromic matrix polynomial with respect to ∗-palindromic perturbations. Such formulas are also obtained for complex T -palindromic pencils and quadratic polynomials. When the T -palindromic polynomial is real, then we derive the backward error of a real number considered as an approximate eigenvalue of the matrix polynomial with respect to real T -palindromic perturbations. In all cases the corresponding minimal structure preserving perturbations are obtained as well. The results are illustrated by numerical experiments. These show that there is significant difference between the backward errors with respect to structure preserving and arbitrary perturbations in many cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems

We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...

متن کامل

Structured Eigenvalue Backward Errors of Matrix Pencils and Polynomials with Hermitian and Related Structures

We derive a formula for the backward error of a complex number λ when considered as an approximate eigenvalue of a Hermitian matrix pencil or polynomial with respect to Hermitian perturbations. The same are also obtained for approximate eigenvalues of matrix pencils and polynomials with related structures like skew-Hermitian, ∗-even and ∗-odd. Numerical experiments suggest that in many cases th...

متن کامل

Symplectic, BVD, and Palindromic Approaches to Discrete-Time Control Problems¶

We give several different formulations for the discrete-time linear-quadratic control problem in terms of structured eigenvalue problems, and discuss the relationships among the associated structured objects: symplectic matrices and pencils, BVD-pencils and polynomials, and the recently introduced classes of palindromic pencils and matrix polynomials. We show how these structured objects can be...

متن کامل

Backward errors and linearizations for palindromic matrix polynomials

We derive computable expressions of structured backward errors of approximate eigenelements of ∗-palindromic and ∗-anti-palindromic matrix polynomials. We also characterize minimal structured perturbations such that approximate eigenelements are exact eigenelements of the perturbed polynomials. We detect structure preserving linearizations which have almost no adverse effect on the structured b...

متن کامل

Ela Palindromic Linearizations of a Matrix Polynomial of Odd Degree Obtained from Fiedler Pencils with Repetition

Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2015